Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
FunProbe: Probing Functions from Binary Code through Probabilistic Analysis
ESEC/FSE 2023: Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software EngineeringNovember 2023, Pages 1419–1430https://doi.org/10.1145/3611643.3616366Current function identification techniques have been mostly focused on a specific set of binaries compiled for a specific CPU architecture. While recent deep-learning-based approaches theoretically can handle binaries from different architectures, they ...
- research-articleJuly 2023
On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter
Automation and Remote Control (ARCO), Volume 84, Issue 7Jul 2023, Pages 772–787https://doi.org/10.1134/S0005117923070068AbstractWe consider the intractable problem of finding several edge-disjoint spanning trees of the minimum total weight with a given diameter in complete undirected graph in current paper. The weights of edges of a graph are random variables from several ...
- research-articleSeptember 2022
A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility
Operations Research (OPRH), Volume 70, Issue 5September-October 2022, Pages 2655–2673https://doi.org/10.1287/opre.2022.2304Motivated by logistical problems faced by a large supply chain software company, the paper, “A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility,” studies a vehicle routing problem where some ...
We propose a new approach for the vehicle routing problem with stochastic customer demands revealed before vehicles are dispatched. We combine ideas from vehicle routing and manufacturing process flexibility to propose overlapped routing strategies with ...
- abstractAugust 2022
Who Has the Last Word? Understanding How to Sample Online Discussions
WWW '22: Companion Proceedings of the Web Conference 2022April 2022, Page 390https://doi.org/10.1145/3487553.3524188In online debates, as in offline ones, individual utterances or arguments support or attack each other, leading to some subset of arguments (potentially from different sides of the debate) being considered more relevant than others. However, online ...
-
Symbolic parallel adaptive importance sampling for probabilistic program analysis
ESEC/FSE 2021: Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software EngineeringAugust 2021, Pages 1166–1177https://doi.org/10.1145/3468264.3468593Probabilistic software analysis aims at quantifying the probability of a target event occurring during the execution of a program processing uncertain incoming data or written itself using probabilistic programming constructs. Recent techniques combine ...
- research-articleJune 2021
Who Has the Last Word? Understanding How to Sample Online Discussions
ACM Transactions on the Web (TWEB), Volume 15, Issue 3Article No.: 12, Pages 1–25https://doi.org/10.1145/3452936In online debates, as in offline ones, individual utterances or arguments support or attack each other, leading to some subset of arguments (potentially from different sides of the debate) being considered more relevant than others. However, online ...
- research-articleOctober 2020
Large Very Dense Subgraphs in a Stream of Edges
FODS '20: Proceedings of the 2020 ACM-IMS on Foundations of Data Science ConferenceOctober 2020, Pages 107–117https://doi.org/10.1145/3412815.3416884We study the detection and the reconstruction of a large very dense subgraph in a social graph with n nodes and m edges given as a stream of edges, when the graph follows a power law degree distribution, in the regime when $m=O(n. łog n)$. A subgraph is ...
- research-articleSeptember 2020
On the probabilistic analysis of neural networks
SEAMS '20: Proceedings of the IEEE/ACM 15th International Symposium on Software Engineering for Adaptive and Self-Managing SystemsJune 2020, Pages 5–8https://doi.org/10.1145/3387939.3391594Neural networks are powerful tools for automated decision-making, seeing increased application in safety-critical domains, such as autonomous driving. Due to their black-box nature and large scale, reasoning about their behavior is challenging. ...
- research-articleFebruary 2020
Probabilistic analysis of QoS‐aware service composition with explicit environment models
IET Software (SFW2), Volume 14, Issue 1February 2020, Pages 59–71https://doi.org/10.1049/iet-sen.2019.0152In service composition, quality‐of‐service (QoS) represents a crucial indicator for the policy adoption. Existing composition strategies rarely address the influence of the environment, which may influence QoS and thus lead to sub‐optimal composition ...
- surveyFebruary 2019
Probabilistic Worst-Case Timing Analysis: Taxonomy and Comprehensive Survey
- Francisco J. Cazorla,
- Leonidas Kosmidis,
- Enrico Mezzetti,
- Carles Hernandez,
- Jaume Abella,
- Tullio Vardanega
ACM Computing Surveys (CSUR), Volume 52, Issue 1Article No.: 14, Pages 1–35https://doi.org/10.1145/3301283The unabated increase in the complexity of the hardware and software components of modern embedded real-time systems has given momentum to a host of research in the use of probabilistic and statistical techniques for timing analysis. In the last few ...
- research-articleJuly 2018
Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary
SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and ArchitecturesJuly 2018, Pages 173–182https://doi.org/10.1145/3210377.3210399We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each ...
- research-articleJune 2018
Measurement-based cache representativeness on multipath programs
DAC '18: Proceedings of the 55th Annual Design Automation ConferenceJune 2018, Article No.: 123, Pages 1–6https://doi.org/10.1145/3195970.3196075Autonomous vehicles in embedded real-time systems increase critical-software size and complexity whose performance needs are covered with high-performance hardware features like caches, which however hampers obtaining WCET estimates that hold valid for ...
- research-articleJune 2018
Cache side-channel attacks and time-predictability in high-performance critical real-time systems
DAC '18: Proceedings of the 55th Annual Design Automation ConferenceJune 2018, Article No.: 98, Pages 1–6https://doi.org/10.1145/3195970.3196003Embedded computers control an increasing number of systems directly interacting with humans, while also manage more and more personal or sensitive information. As a result, both safety and security are becoming ubiquitous requirements in embedded ...
- articleJune 2018
Probabilistic analysis of the 1+1-evolutionary algorithm
Evolutionary Computation (EVOL), Volume 26, Issue 2Pages 299–345https://doi.org/10.1162/evco_a_00212We give a detailed analysis of the optimization time of the <inline-formula><inline-graphic href="evco_a_00212inline1.gif"/></inline-formula>-Evolutionary Algorithm under two simple fitness functions OneMax and LeadingOnes. The problem has been ...
- research-articleJune 2017
Measurement-Based Worst-Case Execution Time Estimation Using the Coefficient of Variation
ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 22, Issue 4Article No.: 72, Pages 1–29https://doi.org/10.1145/3065924Extreme Value Theory (EVT) has been historically used in domains such as finance and hydrology to model worst-case events (e.g., major stock market incidences). EVT takes as input a sample of the distribution of the variable to model and fits the tail ...
- research-articleSeptember 2016
Smoothed Analysis of the 2-Opt Algorithm for the General TSP
ACM Transactions on Algorithms (TALG), Volume 13, Issue 1Article No.: 10, Pages 1–15https://doi.org/10.1145/29729532-Opt is a simple local search heuristic for the traveling salesperson problem that performs very well in experiments with respect to both running time and solution quality. In contrast to this, there are instances on which 2-Opt may need an exponential ...
- research-articleJune 2016
A probabilistic scheduling framework for mixed-criticality systems
DAC '16: Proceedings of the 53rd Annual Design Automation ConferenceJune 2016, Article No.: 132, Pages 1–6https://doi.org/10.1145/2897937.2897971We propose a probabilistic scheduling framework for the design and development of mixed-criticality systems, i.e., where tasks with different levels of criticality need to be scheduled on a shared resource. Whereas highly critical tasks normally require ...
- research-articleMay 2016
Correlation-Aware Probabilistic Timing Analysis for the Dynamic Segment of FlexRay
ACM Transactions on Embedded Computing Systems (TECS), Volume 15, Issue 3Article No.: 54, Pages 1–31https://doi.org/10.1145/2870635We propose an analytical framework for probabilistic timing analysis of the event-triggered Dynamic segment of the FlexRay communication protocol. Specifically, our framework computes the Deadline Miss Ratio of each message. The core problem is ...
- articleDecember 2015
Symbolic Computing In Probabilistic And Stochastic Analysis
International Journal of Applied Mathematics and Computer Science (IJAMCS), Volume 25, Issue 412 2015, Pages 961–973AbstractThe main aim is to present recent developments in applications of symbolic computing in probabilistic and stochastic analysis, and this is done using the example of the well-known MAPLE system. The key theoretical methods discussed are i ...